Adaptation of the Fuzzy K-nearest Neighbor Classifier for Manufacturing Automation

نویسندگان

  • Kenneth W. Tobin
  • Shaun S. Gleason
  • Thomas P. Karnowski
چکیده

The use of supervised pattern recognition technologies for automation in the manufacturing environment requires the development of systems that are easy to train and use. In general, these systems attempt to emulate an inspection or measurement function typically performed by a manufacturing engineer or technician. This paper describes a self-optimizing classification system for automatic decision making in the manufacturing environment. This classification system identifies and labels unique distributions of product defects denoted as “signatures”. The technique relies on encapsulating human experience through a teaching method to emulate the human response to various manufacturing situations. This has been successfully accomplished through the adaptation and extension of a feature-based, fuzzy k-nearest neighbor (k-NN) classifier that has been implemented in a pair-wise fashion. The classifier works with pair-wise combinations of the userdefined classes so that a significant reduction in feature space and problem complexity can be achieved. This k-NN implementation makes extensive use of hold-one-out results and fuzzy ambiguity information to optimize its performance. A semiconductor manufacturing case study will be presented. The technique uses data collected from in-line optical inspection tools to interpret and rapidly identify characteristic signatures that are uniquely associated with the manufacturing process. The system then alerts engineers to probable yield-limiting conditions that require attention.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comparing pixel-based and object-based algorithms for classifying land use of arid basins (Case study: Mokhtaran Basin, Iran)

In this research, two techniques of pixel-based and object-based image analysis were investigated and compared for providing land use map in arid basin of Mokhtaran, Birjand. Using Landsat satellite imagery in 2015, the classification of land use was performed with three object-based algorithms of supervised fuzzy-maximum likelihood, maximum likelihood, and K-nearest neighbor. Nine combinations...

متن کامل

FUZZY K-NEAREST NEIGHBOR METHOD TO CLASSIFY DATA IN A CLOSED AREA

Clustering of objects is an important area of research and application in variety of fields. In this paper we present a good technique for data clustering and application of this Technique for data clustering in a closed area. We compare this method with K-nearest neighbor and K-means.  

متن کامل

Diagnosis of Tempromandibular Disorders Using Local Binary Patterns

Background: Temporomandibular joint disorder (TMD) might be manifested as structural changes in bone through modification, adaptation or direct destruction. We propose to use Local Binary Pattern (LBP) characteristics and histogram-oriented gradients on the recorded images as a diagnostic tool in TMD assessment.Material and Methods: CBCT images of 66 patients (132 joints) with TMD and 66 normal...

متن کامل

Presentation of K Nearest Neighbor Gaussian Interpolation and comparing it with Fuzzy Interpolation in Speech Recognition

Hidden Markov Model is a popular statisical method that is used in continious and discrete speech recognition. The probability density function of observation vectors in each state is estimated with discrete density or continious density modeling. The performance (in correct word recognition rate) of continious density is higher than discrete density HMM, but its computation complexity is very ...

متن کامل

Presentation of K Nearest Neighbor Gaussian Interpolation and comparing it with Fuzzy Interpolation in Speech Recognition

Hidden Markov Model is a popular statisical method that is used in continious and discrete speech recognition. The probability density function of observation vectors in each state is estimated with discrete density or continious density modeling. The performance (in correct word recognition rate) of continious density is higher than discrete density HMM, but its computation complexity is very ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998